منابع مشابه
Complete Inference Rules for the Cancellation Laws
1 . I n t r o d u c t i o n In many cases, specialiied inference rules which incorporate certain axioms into the inference mechanism can produce fewer redundant consequences and more efficient proofs. The most notable example is paramodulation. Inference rules for inequalities, partial orerings, special binary relations have also been found ([BIH80], [S1N73], [MaW85]). Recently there has also b...
متن کاملConservation Laws and Invariant Measures in Surjective Cellular Automata
We discuss a close link between two seemingly different topics studied in the cellular automata literature: additive conservation laws and invariant probability measures. We provide an elementary proof of a simple correspondence between invariant full-support Bernoulli measures and interaction-free conserved quantities in the case of onedimensional surjective cellular automata. We also discuss ...
متن کاملSome Completeness Results for Compactly Surjective Subgroups
Suppose κk,Z(ξ̄) ∼ ‖L ‖. M. Williams’s construction of unconditionally solvable sets was a milestone in Euclidean analysis. We show that F ⊃ −1. Next, in this context, the results of [24] are highly relevant. Recent developments in symbolic operator theory [24] have raised the question of whether Z < j.
متن کاملProduct decomposition for surjective 2-block NCCA
It is known that injective Cellular Automata (CA) are surjective. In general, the converse is not true, and there are many algebraic CA counterexamples. However, there are interesting subclasses where this might be true. For example, if a surjective CA has entropy 0 then it is almost injective (Moothathu (2011)) and it is not known if it is actually injective. The author believes there are some...
متن کاملApproximation for Maximum Surjective Constraint Satisfaction Problems
Maximum surjective constraint satisfaction problems (Max-SurCSPs) are computational problems where we are given a set of variables denoting values from a finite domain B and a set of constraints on the variables. A solution to such a problem is a surjective mapping from the set of variables to B such that the number of satisfied constraints is maximized. We study the approximation performance t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1984
ISSN: 0168-0072
DOI: 10.1016/0168-0072(84)90011-3